Towards Syntactic Approximate Matching - A Pre-Processing Experiment
نویسندگان
چکیده
منابع مشابه
Towards Syntactic Approximate Matching - A Pre-Processing Experiment
Over the past few years, the popularity of approximate matching algorithms (a.k.a. fuzzy hashing) has increased. Especially within the area of bytewise approximate matching, several algorithms were published, tested, and improved. It has been shown that these algorithms are powerful, however they are sometimes too precise for real world investigations. That is, even very small commonalities (e....
متن کاملAdaptive Approximate Record Matching
Typographical data entry errors and incomplete documents, produce imperfect records in real world databases. These errors generate distinct records which belong to the same entity. The aim of Approximate Record Matching is to find multiple records which belong to an entity. In this paper, an algorithm for Approximate Record Matching is proposed that can be adapted automatically with input error...
متن کاملFast, Flexible Syntactic Pattern Matching and Processing
Program understanding can be assisted by tools that match patterns in the program source. Lexical pattern matchers provide excellent performance and ease of use, but have a limited vocabulary. Syntactic matchers provide more precision, but may sacrifice performance, retargetability, ease of use, or generality. To achieve more of the benefits of both models, we extend the pattern syntax of AWK t...
متن کاملTowards a new approximate matching function for digital forensics investigations
The use of automated procedures to handle the massive volume of data available nowadays is required, especially in digital forensic investigations in which time is a scarce resource. The Known File Filtering method is one of the solutions, separating relevant from irrelevant information. Due to limitations on cryptographic hash functions (inability to detect similar data), approximate matching ...
متن کاملadaptive approximate record matching
typographical data entry errors and incomplete documents, produce imperfect records in real world databases. these errors generate distinct records which belong to the same entity. the aim of approximate record matching is to find multiple records which belong to an entity. in this paper, an algorithm for approximate record matching is proposed that can be adapted automatically with input error...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Digital Forensics, Security and Law
سال: 2016
ISSN: 1558-7223
DOI: 10.15394/jdfsl.2016.1381